منابع مشابه
Periodicity and unbordered segments of words
In 1979 Ehrenfeucht and Silberger published an article [9] where the relationship between the length of a word and the maximum length of its unbordered factors (segments) was for the first time investigated. Periodicity and borderedness are two basic properties of words that play a rôle in many areas of computer science such as string searching algorithms [13, 3, 7], data compression [20, 6], a...
متن کاملPeriodicity and Unbordered Segments of Words
In 1979 Ehrenfeucht and Silberger published an article [9] where the relationship between the length of a word and the maximum length of its unbordered factors (segments) was for the first time investigated. Periodicity and borderedness are two basic properties of words that play a rôle in many areas of computer science such as string searching algorithms [13, 3, 7], data compression [20, 6], a...
متن کاملPeriodicity and Unbordered Words: A Proof of Duval?s Conjecture
The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. A word is bordered, if it has a proper prefix that is also a suffix of that word. Consider a finite word w of length n. Let μ(w) denote the maximum length of its unbordered factors, and let ∂(w) denote the period of w. Clearly, μ(w) ≤ ∂(w). We establish that μ(w) = ∂(w),...
متن کاملUnbordered factors and Lyndon words
A primitive word w is a Lyndon word if w is minimal among all its conjugates with respect to some lexicographic order. A word w is bordered if there is a nonempty word u such that w = uvu for some word v. A right extension of a word w of length n is a word wu where all factors longer than n are bordered. A right extension wu of w is called trivial if there exists a positive integer k such that ...
متن کاملUnbordered partial words
An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. In this paper, we extend the results on unbordered words to unbordered partial words. Partial words are strings that may have a number of ―do not know‖ symbols. We extend a result of Ehrenfeucht and Silberger which states that if a word u can be written as a concatenation of nonem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2007
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1255443.1255448